Complete theory

Results: 1780



#Item
401NP-complete problems / Analysis of algorithms / Parameterized complexity / Complexity classes / Kernelization / Dominating set / Feedback vertex set / Michael Fellows / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics

Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-09-04 05:58:10
402Topological graph theory / Graph drawing / NP-complete problems / Geometric graph theory / Graph embedding / Planar graph / Graph coloring / Force-based algorithms / Graph / Graph theory / Mathematics / Theoretical computer science

Curriculum Vitae Stephen G. Kobourov Department of Computer Science University of Arizona, Tucson AZWeb: http://www.cs.arizona.edu/˜kobourov Email:

Add to Reading List

Source URL: www.cs.arizona.edu

Language: English - Date: 2015-04-13 15:56:42
403Combinatorics / Graph theory / NP-complete problems / Conjectures / Mathematics / Fibonacci numbers / Theoretical computer science

CS 373 Homework 5 (dueSpring 1999

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:54:11
404Mathematics / Dominating set / Unit disk graph / Independent set / APX / Approximation algorithm / Vertex cover / Planar separator theorem / Theoretical computer science / Graph theory / NP-complete problems

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
405Complexity classes / NP-complete problems / Mathematical optimization / NP-complete / Computational problems / P versus NP problem / NP / Decision problem / Clique problem / Theoretical computer science / Computational complexity theory / Applied mathematics

Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1

Add to Reading List

Source URL: www.asiapacific-mathnews.com

Language: English - Date: 2014-02-27 03:55:07
406NP-complete problems / Spanning tree / Steiner tree problem / Minimum spanning tree / Time complexity / Approximation algorithm / Rectilinear Steiner tree / Theoretical computer science / Graph theory / Computational complexity theory

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:29:08
407Planar graphs / Eulerian path / Clique / Tree / Connectivity / Graph / Edge coloring / Hamiltonian path / Graph theory / Graph coloring / NP-complete problems

Name: ID: ICS 163 — Graph Algorithms — Winter 1994 — Final

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2006-04-27 18:46:37
408NP-complete problems / Analysis of algorithms / Complexity classes / Parameterized complexity / Kernelization / Bidimensionality / Dominating set / Exponential time hypothesis / Feedback vertex set / Theoretical computer science / Computational complexity theory / Applied mathematics

The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-06 03:04:07
409Group theory / Order / Optimization problem / NP-complete problems / Network flow / Combinatorial optimization / Theoretical computer science / Mathematics / Computational complexity theory

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗ Michael Hemmer∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-07-28 18:32:50
410NP-complete problems / Interval graph / Vertex cover / Graph coloring / Matching / Independent set / Dominating set / Path decomposition / Graph theory / Theoretical computer science / Mathematics

Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2010-03-19 09:17:44
UPDATE